Objects and Subtyping in the λΠ-Calculus Modulo
نویسندگان
چکیده
We present a shallow embedding of the Object Calculus of Abadi and Cardelli in the λΠ-calculus modulo, an extension of the λΠ-calculus with rewriting. This embedding may be used as an example of translation of subtyping. We prove this embedding correct with respect to the operational semantics and the type system of the Object Calculus. We implemented a translation tool from the Object Calculus to Dedukti, a type-checker for the λΠ-calculus modulo. 1998 ACM Subject Classification F.4.1 Lambda calculus and related systems
منابع مشابه
Embedding Pure Type Systems in the Lambda-Pi-Calculus Modulo
The lambda-Pi-calculus allows to express proofs of minimal predicate logic. It can be extended, in a very simple way, by adding computation rules. This leads to the lambda-Pi-calculus modulo. We show in this paper that this simple extension is surprisingly expressive and, in particular, that all functional Pure Type Systems, such as the system F, or the Calculus of Constructions, can be embedde...
متن کاملCoqInE: Translating the Calculus of Inductive Constructions into the λΠ-calculus Modulo
We show how to translate the Calculus of Inductive Constructions (CIC) as implemented by Coq into the λΠ-calculus modulo, a proposed common backend proof format for heterogeneous proof assistants.
متن کاملTowards explicit rewrite rules in the λΠ-calculus modulo
This paper provides a new presentation of the λΠ-calculus modulo where the addition of rewrite rules is made explicit. The λΠ-calculus modulo is a variant of the λ-calculus with dependent types where β-reduction is extended with user-defined rewrite rules. Its expressiveness makes it suitable to serve as an output language for theorem provers, certified development tools or proof assistants. Ad...
متن کاملThe Subject Reduction Property in the λΠ-calculus modulo
In type theory, the subject reduction (or type preservation) property states that the type of a λ-term is preserved under reduction. This article studies this property in the context of the λΠ-calculus modulo, a variant of the λ-calculus with dependent types (λΠ-calculus) where β-reduction is extended with user-defined object-level and type-level rewrite rules. We show that it is equivalent to ...
متن کاملModels and Termination of Proof Reduction in the lambda Pi-Calculus Modulo Theory
We define a notion of model for the λΠ-calculus modulo theory and prove a soundness theorem. We then define a notion of super-consistency and prove that proof reduction terminates in the λΠ-calculus modulo any super-consistent theory. We prove this way the termination of proof reduction in several theories including Simple type theory and the Calculus of constructions.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014